Cooperative Search and Rescue with a Team of Mobile Robots - Advanced Robotics, 1997. ICAR '97. Proceedings., 8th International Conference on

We present an implemented algorithm f o r a distributed team of autonomous mobile robots to search for an object. When one robot finds i t , they all gather around it, and then manipulate (“rescue”) i t . The algorithm exploits parallelism, with all robots searching concurrently, and also teamwork, because the manipulation is performed cooperatively. Our algorithm is fully distributed; the robots communicate with each other, and there is no central server or supervisor. Applications include hazardous waste cleanup, bomb detection and removal, materials delivery, and eventually the rescue of survivors of accidents or disasters. The search and rescue program was written using MOVER, a programming system for distributed tasks. MOVER is quite general, allowing arbitrary synchronization of tasks among workstations and robots. The system provides high-level programming constructs for task distribution across robots. Finally, MOVER encourages code re-use because the task distribution mechanism can synchronize any set of procedures (without rewriting), allowing the programmer of a distributed task to access libraries of robot software Written for single-robot tasks.